Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation
نویسنده
چکیده
Constraint Satisfaction Problems form a class of problems that are generally computationally difficult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms, as well as two evolutionary algorithms, and compare them on randomly generated instances of binary constraint satisfaction problems. We find that the evolutionary algorithms are less effective than the classical techniques.
منابع مشابه
Comparing evolutionary algorithms on binary constraint satisfaction problems
Constraint handling is not straightforward in evolutionary algorithms (ea) since the usual search operators, mutation and recombination, are ‘blind’ to constraints. Nevertheless, the issue is highly relevant, for many challenging problems involve constraints. Over the last decade numerous eas for solving constraint satisfaction problems (csp) have been introduced and studied on various problems...
متن کاملEvolutionary Transitions as a Metaphor for Evolutionary Optimisation
This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specifically it incorporates mechanisms for the emergence of increasingly complex individuals from the interaction of more simple ones. The biological principles for transition are outlined and mapped onto an evolutionary computation co...
متن کاملSoftware ENgineering A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems
We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, ...
متن کاملA Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems
We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, ...
متن کاملApplying Adaptive Evolutionary Algorithms to Hard Problems
This report is based on the work I have done for my Master Thesis project. The project as a whole consists of research done in the eld of evolutionary computation, and it is split into two distinct parts. The main theme is adaptive evolutionary algorithms. The rst part covers the research done on solving binary constraint satisfaction problems using adaptive evolutionary algorithms. This involv...
متن کامل